Batch verifying multiple RSA digital signatures
نویسندگان
چکیده
Conclusions; We propose a fully digital auto-focusing system based on novel out-of-focus blur estimation and restoration algorithms. The main advantages of the proposed PSF estimation algorithm are that it can estimate both radius and sample values of an arbitrary circularly symmetric blur, and that it does not require the DFT or a numerical optimisation process for parameter estimation. As a result it is far more efficient than the existing methods in terms of computational complexity. The proposed system can accurately estimate not only simulated out-of-focus blur, but also real photographical blur.
منابع مشابه
Cryptanalysis of the Batch Verifying Multiple RSA Digital Signatures
Recently, Harn proposed an efficient scheme that can batch verification multiple RSA digital signatures. His scheme can reduce signature verification time. However, there is a weakness in his scheme. In this study, we present two methods to against his scheme.
متن کاملAn Efficient Batch Verifying Scheme for Detecting Illegal Signatures
In a batch verifying scheme, multiple RSA digital signatures can be verified simultaneously in just one exponential operation time. Currently, the verifier could not easily detect where the signature-verification fault was located in most schemes, if the batch verification fails. In this article, we proposed a new batch verifying multiple RSA digital signatures scheme based on a cube. The schem...
متن کاملCryptanalysis of the Batch Verifying Multiple DSA-type Digital Signatures
To reduce the signature verification time, Harn proposed an efficient batch verifying multiple DSA-type digital signatures instead of verifying each individual digital signature separately. However, there is a weakness in his scheme. In this article, we present our attack to against his scheme.
متن کاملHow to Cheat Verifiers in Shao’s Batch Verifying Multiple DSA-type Digital Signatures
Batch verification can reduce large computational cost when multiple signatures are verified together. In 2001, Shao proposed an efficient algorithm for batch verifying DSA-type multiple signatures. He also provided mathematic proof to show that his scheme has the same security as the underlying DSA-type signature. In this paper, we first point out that Shao’s algorithm is insecure, and further...
متن کاملPractical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are short, and yet wheremanymessages from different signers be verified very quickly. RSA signatures satisfy the latter condition, but are generally thousands of bits in length. Recent developments in pairing-based cryptography produced a number of “short” signatures which provide equivalent security in a fraction of the space. ...
متن کامل